Optimal Derivative-Free Root Finding Methods Based on Inverse Interpolation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Class of Derivative Free Optimal Root Finding Methods Based on Rational Interpolation

We construct a new general class of derivative free n-point iterative methods of optimal order of convergence 2 (n-1) using rational interpolant. The special cases of this class are obtained. These methods do not need Newton's iterate in the first step of their iterative schemes. Numerical computations are presented to show that the new methods are efficient and can be seen as better alternates.

متن کامل

Optimal derivative-free root finding methods based on the Hermite interpolation

We develop n-point optimal derivative-free root finding methods of order 2n, based on the Hermite interpolation, by applying a first-order derivative transformation. Analysis of convergence confirms that the optimal order of convergence of the transformed methods is preserved, according to the conjecture of Kung and Traub. To check the effectiveness and reliability of the newly presented method...

متن کامل

Root Finding Interpolation Attack

In this paper, we rst show that there are several equivalent keys for t + 1 chosen plaintexts if the degree of the reduced cipher is t?1. This is against the claim by Jakobsen and Knudsen. We also derive an upper bound on the number of equivalent last round keys for t + 1 chosen plaintexts. We further show an eecient method which nds all the equivalent keys by using Rabin's root nding algorithm...

متن کامل

Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation

In this work we show a general procedure to obtain optimal derivative free iterative methods [4] for nonlinear equations f(x) = 0, applying polynomial interpolation to a generic optimal derivative free iterative method of lower order. Let us consider an optimal method of order q = 2n−1, v = φn(x), that uses n functional evaluations. Performing a Newton step w = v − f(v) f ′(v) one obtains a met...

متن کامل

Optimal eighth-order simple root-finders free from derivative

The calculation of derivatives of a function mostly takes up a great deal of time and even in some cases, such as the existing problems in engineering and optimization, is impossible to be evaluated directly. Accordingly, an accurate derivative-free class of three-step methods is suggested for solving ( ) = 0. The proposed three-step technique comprises four evaluations of the function per iter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2019

ISSN: 2227-7390

DOI: 10.3390/math7020164